Forcing indestructibility of set-theoretic axioms

نویسنده

  • Bernhard König
چکیده

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add generic countable sequences high up in the set-theoretic hierarchy even before collapsing everything down to א1. Later we give applications, among them the consistency of MM with אω not being Jonsson which answers a question raised during Oberwolfach 2005.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forcing indestructibility of MAD families

Let A ⊆ [ω]ω be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indestructibility for several classical forcing notions P. In particular, we provide a combinatorial characterization of P-indestructibility and, assuming a fragment of MA, we construct maximal almost disjoint families wh...

متن کامل

Notes to “The Resurrection Axioms”

I will discuss a new class of forcing axioms, the Resurrection Axioms (RA), and the Weak Resurrection Axioms (wRA). While Cohen’s method of forcing has been designed to change truths about the set-theoretic universe you live in, the point of Resurrection is that some truths that have been changed by forcing can in fact be resurrected, i.e. forced to hold again. In this talk, I will illustrate h...

متن کامل

Unprepared Indestructibility

I present a forcing indestructibility theorem for the large cardinal axiom Vopěnka’s Principle. It is notable in that there is no preparatory forcing required to make the axiom indestructible, unlike the case for other indestructibility results. §

متن کامل

Some Second Order Set Theory

Set theory is the study of sets, particularly the transfinite, with a focus on well-founded transfinite recursion. Began with Cantor in late 19th century, matured in mid 20th century. Set theory today is vast: independence, large cardinals, forcing, combinatorics, the continuum, descriptive set theory,... Set theory also serves as an ontological foundation for all (or much of) mathematics. Math...

متن کامل

Statement Chris Lambie

My research lies mostly in logic and set theory, and in applications of set-theoretic tools to other areas of mathematics, such as graph theory, algebra, and topology. My set-theoretic work is largely combinatorial in nature and comes in one of two flavors: ZFC results and independence results. ZFC stands for Zermelo-Fraenkel axioms with choice and is the standard set of axioms in which set the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 72  شماره 

صفحات  -

تاریخ انتشار 2007